From Coalgebraic to Monoidal Traces
نویسنده
چکیده
The main result of this paper shows how coalgebraic traces, in suitable Kleisli categories, give rise to traced monoidal structure in those Kleisli categories, with finite coproducts as monoidal structure. At the heart of the matter lie partially additive monads inducing partially additive structure in their Kleisli categories. By applying the standard “Int” construction one obtains compact closed categories for “bidirectional monadic computation”.
منابع مشابه
Traces for coalgebraic components
This paper contributes a feedback operator, in the form of a monoidal trace, to the theory of coalgebraic, state-based modelling of components. The feedback operator on components is shown to satisfy the trace axioms of Joyal, Street and Verity. We employ McCurdy’s tube diagrams, an extension of standard string diagrams for monoidal categories, for representing and manipulating component diagra...
متن کاملTracing the Man in the Middle in Monoidal Categories
Man-in-the-Middle (MM) is not only a ubiquitous attack pattern in security, but also an important paradigm of network computation and economics. Recognizing ongoing MM-attacks is an important security task; modeling MM-interactions is an interesting task for semantics of computation. Traced monoidal categories are a natural framework for MM-modelling, as the trace structure provides a tool to h...
متن کاملMonoidal computer III: A coalgebraic view of computability and complexity
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a high-level language for theory of computation, flexible enough to allow abstracting away the low level implementation details when they are irrelevant, or t...
متن کاملCoalgebraic Multigames
Coalgebraic games have been recently introduced as a generalization of Conway games and other notions of games arising in different contexts. Using coalgebraic methods, games can be viewed as elements of a final coalgebra for a suitable functor, and operations on games can be analyzed in terms of (generalized) coiteration schemata. Coalgebraic games are sequential in nature, i.e. at each step e...
متن کاملFree Monoids over Semigroups in a Monoidal Category Construction and Applications
The adjunction of a unit to an algebraic structure with a given binary associative operation is discussed by interpreting such structures as semigroups and monoids respectively in a monoidal category. This approach then allows for results on the adjunction of counits to coalgebraic structures with a binary co-associative co-operation as well. Special attention is paid to situations where a give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 264 شماره
صفحات -
تاریخ انتشار 2010